Plausible Move Generation in Two-player Complete Information Games Using Static Evaluation.
نویسندگان
چکیده
منابع مشابه
Algorithms for computing strategies in two-player simultaneous move games
Simultaneous move games model discrete, multistage interactions where at each stage players simultaneously choose their actions. At each stage, a player does not know what action the other player will take, but otherwise knows the full state of the game. This formalism has been used to express games in general game playing and can also model many discrete approximations of real-world scenarios....
متن کاملStatic Two-Player Evasion-Interrogation Games with Uncertainty
We consider electromagnetic evasion-interrogation games wherein the evader can use ferroelectric material coatings to attempt to avoid detection while the interrogator can manipulate the interrogating frequencies (wave numbers) and angles of incidence of the interrogating inputs to enhance detection and identification. The resulting problems are formulated as two player games in which one playe...
متن کاملAutomatic Move Pruning in General Single-Player Games
Move pruning is a low-overhead technique for reducing the size of a depth first search tree. The existing algorithm for automatically discovering move pruning information is restricted to games where all moves can be applied to every state. This paper demonstrates an algorithm which handles a general class of single player games. It gives experimental results for our technique, demonstrating bo...
متن کاملA Quantum Approach To Static Games Of Complete Information
We extend the concept of a classical two-person static game to the quantum domain, by giving an Hilbert structure to the space of classical strategies and studying the Battle of the Sexes game. We show that the introduction of entangled strategies leads to a unique solution of this game. PACS: 03.65.-w, 03.65.Bz
متن کاملProbabilistic One-Player Ramsey Games via Deterministic Two-Player Games
Consider the following probabilistic one-player game: The board is a graph with n vertices, which initially contains no edges. In each step, a new edge is drawn uniformly at random from all non-edges and is presented to the player, henceforth called Painter. Painter must assign one of r available colors to each edge immediately, where r ≥ 2 is a fixed integer. The game is over as soon as a mono...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence
سال: 2001
ISSN: 1346-0714,1346-8030
DOI: 10.1527/tjsai.16.55